Ordering Networks
نویسنده
چکیده
This extended abstract discusses the problem of defining quasi-orders that are suitable for use with network rewriting. The author’s primary interest is in using network rewriting as a tool for equational reasoning in algebraic theories with both operations and co-operations.
منابع مشابه
Learning Bayesian Network Structure Using Genetic Algorithm with Consideration of the Node Ordering via Principal Component Analysis
‎The most challenging task in dealing with Bayesian networks is learning their structure‎. ‎Two classical approaches are often used for learning Bayesian network structure;‎ ‎Constraint-Based method and Score-and-Search-Based one‎. ‎But neither the first nor the second one are completely satisfactory‎. ‎Therefore the heuristic search such as Genetic Alg...
متن کاملTemporal Message Ordering in Wireless Sensor Networks
Wireless sensor networks (WSN) are envisioned to fulfill complex monitoring tasks in the near future. A typical WSN application like object tracking fuses sensor readings produced by nodes throughout the network to obtain a high-level sensing result such as the current speed of a tracked vehicle. In order to produce correct results, the application typically has to process sensor events in the ...
متن کاملEffect of DisCSP Variable-Ordering Heuristics in Scale-Free Networks
A Distributed Constraint Satisfaction Problem (DisCSP) is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various algorithms for solving DisCSPs have been developed, which are intended for general purposes, i.e., they can be applied to any network structure. However, if a network has some particular structure, e.g., the network structu...
متن کاملOrdering in Mobile Networks Using Integrated Sequencers
Distributed applications mostly interact by exchanging messages. For this purpose the messages often need to be ordered. Since today more and more mobile devices are used message ordering in mobile networks is increasingly important. Most ordering protocols for mobile networks use vector clocks or matrices. In static networks often multicast trees ensure message ordering. In this paper we propo...
متن کاملThe Search of Causal Orderings: A Short Cut for Learning Belief Networks
Although we can build a belief network starting from any ordering of its variables, its structure depends heavily on the ordering being selected: the topology of the network, and therefore the number of conditional independence relationships that may be explicitly represented can vary greatly from one ordering to another. We develop an algorithm for learning belief networks composed of two main...
متن کاملHierarchical Ordering of Reticular Networks
The structure of hierarchical networks in biological and physical systems has long been characterized using the Horton-Strahler ordering scheme. The scheme assigns an integer order to each edge in the network based on the topology of branching such that the order increases from distal parts of the network (e.g., mountain streams or capillaries) to the "root" of the network (e.g., the river outl...
متن کامل